A faster strongly polynomial minimum cost flow algorithmORLIN, J. B.Operations research. 1993, Vol 41, Num 2, pp 338-350, issn 0030-364XArticle

On the simplex algorithm for networks and generalized networksORLIN, J. B.Mathematical programming study. 1985, Num 24, pp 166-178, issn 0303-3929Article

A dual version of Tardos's algorithm for linear programmingORLIN, J. B.Operations research letters. 1986, Vol 5, Num 5, pp 221-226, issn 0167-6377Article

A finitely converging cutting plane techniqueORLIN, J. B.Operations research letters. 1985, Vol 4, Num 1, pp 1-3, issn 0167-6377Article

Finding minimum cost to time ratio cycles with small integral transit timesHARTMANN, M; ORLIN, J. B.Networks (New York, NY). 1993, Vol 23, Num 6, pp 567-574, issn 0028-3045Article

NP-Completeness for minimizing maximum edge length in grid embeddingsMILLER, Z; ORLIN, J. B.Journal of algorithms (Print). 1985, Vol 6, Num 1, pp 10-16, issn 0196-6774Article

A faster algorithm for the inverse spanning tree problemAHUJA, R. K; ORLIN, J. B.Journal of algorithms (Print). 2000, Vol 34, Num 1, pp 177-193, issn 0196-6774Article

Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problemGOLDFARB, D; JIN, Z; ORLIN, J. B et al.Mathematics of operations research. 1997, Vol 22, Num 4, pp 793-802, issn 0364-765XArticle

Determination of optimal vertices from feasible solutions in unimodular linear programmingMIZUNO, S; SAIGAL, R; ORLIN, J. B et al.Mathematical programming. 1993, Vol 59, Num 1, pp 23-31, issn 0025-5610Article

New scaling algorithms for the assignment and minimum mean cycle problemsORLIN, J. B; AHUJA, R. K.Mathematical programming. 1992, Vol 54, Num 1, pp 41-56, issn 0025-5610Article

Parametric linear programming and anti-cycling pivoting rulesMAGNANTI, T. L; ORLIN, J. B.Mathematical programming. 1988, Vol 41, Num 3, pp 317-325, issn 0025-5610Article

On the complexity of four polyhedral set containment problemsFREUND, R. M; ORLIN, J. B.Mathematical programming. 1985, Vol 33, Num 2, pp 139-145, issn 0025-5610Article

Equivalence of the primal and dual simplex algorithms for the maximum flow problemAHUJA, R. K; ORLIN, J. B.Operations research letters. 1997, Vol 20, Num 3, pp 101-108, issn 0167-6377Article

A scaling algorithm for multicommodity flow problemsSCHNEUR, R. R; ORLIN, J. B.Operations research. 1998, Vol 46, Num 2, pp 231-246, issn 0030-364XArticle

A parametric worst case analysis of the LPT heuristic for two uniform machinesMIREAULT, P; ORLIN, J. B; VOHRA, R. V et al.Operations research. 1997, Vol 45, Num 1, pp 116-125, issn 0030-364XArticle

Polynomial dual network simplex algorithmsORLIN, J. B; PLOTKIN, S. A; TARDOS, E et al.Mathematical programming. 1993, Vol 60, Num 3, pp 255-276, issn 0025-5610Article

A fast and simple algorithm for the maximum flow problemAHUJA, R. K; ORLIN, J. B.Operations research. 1989, Vol 37, Num 5, pp 748-759, issn 0030-364X, 12 p.Article

Faster parametric shortest path and minimum-balance algorithmsYOUNG, N. E; TARJANT, R. E; ORLIN, J. B et al.Networks (New York, NY). 1991, Vol 21, Num 2, pp 205-221, issn 0028-3045Article

Solving inverse spanning tree problems through network flow techniquesSOKKALINGAM, P. T; AHUJA, R. K; ORLIN, J. B et al.Operations research. 1999, Vol 47, Num 2, pp 291-298, issn 0030-364XArticle

Improved time bounds for the maximum flow problemAHUJA, R. K; ORLIN, J. B; TARJAN, R. E et al.SIAM journal on computing (Print). 1989, Vol 18, Num 5, pp 939-954, issn 0097-5397Article

Recognizing hidden bicircular networksSHULL, R; SHUCHAT, A; ORLIN, J. B et al.Discrete applied mathematics. 1993, Vol 41, Num 1, pp 13-53, issn 0166-218XArticle

The structure of bases in bicircular matroidsSHULL, R; ORLIN, J. B; SHUCHAT, A et al.Discrete applied mathematics. 1989, Vol 23, Num 3, pp 267-283, issn 0166-218XArticle

New polynomial-time cycle-canceling algorithms for minimum-cost flowsSOKKALINAAM, P. T; AHUJA, R. K; ORLIN, J. B et al.Networks (New York, NY). 2000, Vol 36, Num 1, pp 53-63, issn 0028-3045Article

Diagnosing infeasibilities in network flow problemsAGGARWAL, C. C; AHUJA, R. K; JIANXIU HAO et al.Mathematical programming. 1998, Vol 81, Num 3, pp 263-280, issn 0025-5610Article

A polynomial time primal network simplex algorithm for minimum cost flowsORLIN, J. B.Mathematical programming. 1997, Vol 78, Num 2, pp 109-129, issn 0025-5610Conference Paper